منابع مشابه
NETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملPlane posets, special posets, and permutations
We study the self-dual Hopf algebra HSP of special posets introduced by Malvenuto and Reutenauer and the Hopf algebra morphism from HSP to the Hopf algebra of free quasi-symmetric functions FQSym given by linear extensions. In particular, we construct two Hopf subalgebras both isomorphic to FQSym; the first one is based on plane posets, the second one on heap-ordered forests. An explicit isomor...
متن کاملSubpullbacks and coproducts of $S$-posets
In 2001, S. Bulman-Fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $A_{S}$ over a monoid $S$ that can be described by means of when the functor $A_{S} otimes -$ preserves pullbacks. In this paper, we extend these results to $S$-posets and present equivalent descriptions of weakly kernel p...
متن کاملPosets and planar graphs
Usually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value 1⁄2 t 1l t , thought to be between t 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most 1⁄22l3 . This characterization of outerplanar graphs is closely related to the celebrated result of W. Schnyder...
متن کاملBoolean Posets, Posets under Inclusion and Products of Relational Structures1
In this paper X denotes a set. Let L be a lattice. Note that Poset(L) has l.u.b.’s and g.l.b.’s. Let L be an upper-bounded lattice. One can verify that Poset(L) is upper-bounded. Let L be a lower-bounded lattice. One can verify that Poset(L) is lower-bounded. Let L be a complete lattice. Note that Poset(L) is complete. Let X be a set. Then X is an order in X . Let X be a set. The functor 〈X ,⊆〉...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2014
ISSN: 1029-8479
DOI: 10.1007/jhep01(2014)024